Classical mixed partitions
نویسنده
چکیده
Through a method given in [3], a mixed partition of PG(2n− 1, q2) can be used to construct a (2n− 1)-spread of PG(4n− 1, q) and, hence, a translation plane of order q2n. A mixed partition in this case is a partition of the points of PG(2n− 1, q2) into PG(n− 1, q2)’s and PG(2n− 1, q)’s which we call Baer subspaces. In this paper, we completely classify the mixed partitions which generate regular spreads and, hence, can be classified as classical.
منابع مشابه
Value function of differential games without Isaacs conditions. An approach with nonanticipative mixed strategies
In the present paper we investigate the problem of the existence of a value for differential games without Isaacs condition. For this we introduce a suitable concept of mixed strategies along a partition of the time interval, which are associated with classical nonanticipative strategies (with delay). Imposing on the underlying controls for both players a conditional independence property, we o...
متن کاملTsallis Entropy and Conditional Tsallis Entropy of Fuzzy Partitions
The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...
متن کاملCrossings and Nestings in Set Partitions of Classical Types
We study bijections { Set partitions of type X } −̃→ { Set partitions of type X } for X ∈ {A,B,C,D}, which preserve openers and closers. In types A, B, and C, they interchange • either the number of crossings and of nestings, • or the cardinalities of a maximal crossing and of a maximal nesting. In type D, the results are obtained only in the case of non-crossing and nonnesting set partitions. I...
متن کاملA bijection between noncrossing and nonnesting partitions for classical reflection groups
We present an elementary type preserving bijection between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis.
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 283 شماره
صفحات -
تاریخ انتشار 2004